Fast reconstruction for multichannel compressed sensing using a hierarchically semiseparable solver.

نویسندگان

  • Stephen F Cauley
  • Yuanzhe Xi
  • Berkin Bilgic
  • Jianlin Xia
  • Elfar Adalsteinsson
  • Venkataramanan Balakrishnan
  • Lawrence L Wald
  • Kawin Setsompop
چکیده

PURPOSE The adoption of multichannel compressed sensing (CS) for clinical magnetic resonance imaging (MRI) hinges on the ability to accurately reconstruct images from an undersampled dataset in a reasonable time frame. When CS is combined with SENSE parallel imaging, reconstruction can be computationally intensive. As an alternative to iterative methods that repetitively evaluate a forward CS+SENSE model, we introduce a technique for the fast computation of a compact inverse model solution. METHODS A recently proposed hierarchically semiseparable (HSS) solver is used to compactly represent the inverse of the CS+SENSE encoding matrix to a high level of accuracy. To investigate the computational efficiency of the proposed HSS-Inverse method, we compare reconstruction time with the current state-of-the-art. In vivo 3T brain data at multiple image contrasts, resolutions, acceleration factors, and number of receive channels were used for this comparison. RESULTS The HSS-Inverse method allows for >6× speedup when compared to current state-of-the-art reconstruction methods with the same accuracy. Efficient computational scaling is demonstrated for CS+SENSE with respect to image size. The HSS-Inverse method is also shown to have minimal dependency on the number of parallel imaging channels/acceleration factor. CONCLUSIONS The proposed HSS-Inverse method is highly efficient and should enable real-time CS reconstruction on standard MRI vendors' computational hardware.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An O (N log N) Fast Direct Solver for Partial Hierarchically Semi-Separable Matrices - With Application to Radial Basis Function Interpolation

This article describes a fast direct solver (i.e., not iterative) for partial hierarchically semiseparable systems. This solver requires a storage of O(N logN) and has a computational complexity of O(N logN) arithmetic operations. The numerical benchmarks presented illustrate the method in the context of interpolation using radial basis functions. The key ingredients behind this fast solver are...

متن کامل

Unmanned aerial vehicle field sampling and antenna pattern reconstruction using Bayesian compressed sensing

Antenna 3D pattern measurement can be a tedious and time consuming task even for antennas with manageable sizes inside anechoic chambers. Performing onsite measurements by scanning the whole 4π [sr] solid angle around the antenna under test (AUT) is more complicated. In this paper, with the aim of minimum duration of flight, a test scenario using unmanned aerial vehicles (UAV) is proposed. A pr...

متن کامل

Approximate message-passing with spatially coupled structured operators, with applications to compressed sensing and sparse superposition codes

We study a compressed sensing solver called Approximate Message-Passing when the i.i.d matrices —for which it has been designed— are replaced by structured operators allowing computationally fast matrix multiplications. We show empirically that after proper randomization, the underlying structure of the operators does not significantly affect the performances of the solver. In particular, for s...

متن کامل

Compressed Sensing MRI with Multichannel Data Using GPUs

Abstract—Many clinical MRI applications can benefit from combining compressed sensing with multichannel receiver systems because of the potential to achieve reduced scan time and improve image qualities. However, it comes with the increased computational complexity, particular for advanced CS algorithms and with large number of channels. This paper presents a new CS-MRI reconstruction method fo...

متن کامل

Superfast Multifrontal Method for Large Structured Linear Systems of Equations

In this paper we develop a fast direct solver for large discretized linear systems using the supernodal multifrontal method together with low-rank approximations. For linear systems arising from certain partial differential equations such as elliptic equations, during the Gaussian elimination of the matrices with proper ordering, the fill-in has a low-rank property: all off-diagonal blocks have...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Magnetic resonance in medicine

دوره 73 3  شماره 

صفحات  -

تاریخ انتشار 2015